Complex Chaotic Behavior of a Class of Subshift Cellular Automata

نویسندگان

  • G. Braga
  • Gianpiero Cattaneo
  • Paola Flocchini
  • Giancarlo Mauri
چکیده

A class of parameterized boolean, one-dimensional, biinfinite cellular autom at a has been st udied and t heir behavior observed when some param eters of the local funct ion are changed. T hese aut omata are equivalent to a par t icular class of boolean neural networks and t he change in t he parameters corresponds to a change in the symmetricity of t he connect ion matrix. T he purpo se is to ana lyze t he different dynamics, beginning with a symmet ric connect ion matrix and moving toward an ant isymmet ric one. We have observed that simp le dynamics corresponds to the symmetric situation, whereas the antisymmet rical case yields more complex behavior. On the basis of these observatio ns, we have identified a new class of cellular auto mata tha t is characterized by shift like dynamics (simple and complex subshift rules); these cellular automata correspond to t he asymmet ric sit uations and they are chaotic dynamical syst ems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decidable and Computational properties of Cellular Automata (PhD Thesis)

In this thesis we investigate decidable and computational properties of Cellular Automata. This investigation is intended to be a contribute to the study of the more general theory of Complex Systems. A central interest in the sciences of complex systems is to understand the laws by which a global complex behavior can emerge for the collective interaction of simple components. Computation Theor...

متن کامل

Recursive Cellular Automata Invariant Sets

A bstract. Subshift s of bi-infinit e words give rise to languages in a natural way. Three invariant subshifts associated wit h cellular automata dynamics are considered : the periodic set, non-wandering set , and limit set . Exam ples have been given (see [8,12]) of cellular automata whose invarian t sets give rise to nonrecursive languages. In this pap er , examples are given of cellular aut ...

متن کامل

Towards a Rice Theorem on Traces of Cellular Automata

The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram. We prove the undecidability of a rather large class of problems over trace subshifts of cellular automata.

متن کامل

Cellular Automata with an Infinite Number of Subshift Attractors

The concept of an attractor is essential for understanding the dynamics of cellular automata. An attractor is defined as a limit set (intersection of forward images) of a nonempty clopen (closed and open) invariant set. Classification of cellular automata based on the system of their attractors has been considered in Hurley [1] or Kůrka [2]. The basic distinction is between cellular automata wh...

متن کامل

From Complexity to Random Behaviors; Generate Random Numbers by Confusion in Cellular Automata State’s

Cellular Automata(CA) with evolutionary and complex behaviors are used in several applications such as generating random numbers and cryptography. Because of the intrinsic self-organizing property, pure CA cannot produce a long sequence of random numbers. For increasing the sequence of produced numbers, nonuniform CA, controllable/programmable CA, stimulating factors or combination of several a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Complex Systems

دوره 7  شماره 

صفحات  -

تاریخ انتشار 1993